Constructions preserving evasiveness and collapsibility
نویسندگان
چکیده
منابع مشابه
Non-evasiveness, collapsibility and explicit knotted triangulations
Non-evasiveness is a further strengthening of collapsibility, emerged in theoretical computer science and later studied by Kahn, Saks and Sturtevant [9] and Welker [11]. A 0-dimensional complex is non-evasive if and only if it consists of a single point. Recursively, a d-dimensional simplicial complex (d > 0) is non-evasive if and only if there is some vertex v whose link and deletion are both ...
متن کاملPrivacy-Preserving RFID Systems: Model and Constructions
In this paper, we study systems where a reader wants to authenticate and identify legitimate RFID tags. Such system needs thus to be correct (legitimate tags are accepted) and sound (fake tags are rejected). Moreover, an RFID tag in a privacy-preserving system should be anonymous and untraceable, except for the legitimate reader. We here present the first security model for RFID authentication/...
متن کاملMorse Theory and Evasiveness
x0. Introduction. Consider a game played by 2 players, whom we call the hider and the seeker. Let S be a simplex of dimension n, with vertices x 0 , x 1 ; : : :; x n , and M a subcomplex of S, known to both the hider and the seeker. Let be a simplex of S, known only to the hider. The seeker is permitted to ask questions of the sort \Is vertex x i in ?" The seeker's goal is to determine whether ...
متن کاملHardness Preserving Constructions of Pseudorandom Functions, Revisited
We revisit hardness-preserving constructions of a PRF from any length doubling PRG when there is a non-trivial upper bound q on the number of queries that the adversary can make to the PRF. Very recently, Jain, Pietrzak, and Tentes (TCC 2012) gave a hardness-preserving construction of a PRF that makes only O(log q) calls to the underlying PRG when q = 2 and ≥ 12 . This dramatically improves upo...
متن کاملHardness Preserving Constructions of Pseudorandom Functions
We show a hardness-preserving construction of a PRF from any length doubling PRG which improves upon known constructions whenever we can put a non-trivial upper bound q on the number of queries to the PRF. Our construction requires only O(log q) invocations to the underlying PRG with each query. In comparison, the number of invocations by the best previous hardness-preserving construction (GGM ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1999
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(99)00049-7